Efficient processing of spatial joins using R-trees
نویسندگان
چکیده
منابع مشابه
Parallel Processing of Spatial Joins Using R-trees
In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so-called shared virtual memory which is wellsuited for the design and implementation of parallel spatial join algorithms. We start with an algorithm that consists of three phases: task creation, task assignment and parallel task execution. In order...
متن کاملAn Efficient Cost Model for Spatial Joins Using R-trees
Spatial join is one of the fundamental operations in a Spatial Data Base Management System. Recently, the family of R-tree-based data structures has been adopted to support the execution of spatial joins. This paper introduces an analytical model that efficiently estimates the cost (in terms of disk accesses) of a spatial join query between two spatial datasets. The proposed model is based on a...
متن کاملSpatial Joins and R-trees
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. The paper gives contemporary state in this research area and presents effective algorithm for spatial joins which combines both I/O and CPU cost optimization. This algorithm is designed like a multi-step process [4] and ...
متن کاملBFRJ: Global Optimization of Spatial Joins Using R-trees
Spatial joins are important operations in applications such as Geographic Information Systems, Cartography, and CAD/CAM. Spatial join using existing R-trees is a very useful and popular technique because of both its superior performance and the wide spread implementation of R-trees as spatial index structures. This paper describes a new spatial join method called BFRJ (BreadthFirst R-tree Join)...
متن کاملProcessing of Joins between R-trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are suitable for storing 2-dimensional regional data and their linear variant is used in many Geographical Information Systems for this purpose. In this report, we present an algorithm suitable for processing of join quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1993
ISSN: 0163-5808
DOI: 10.1145/170036.170075